Nuprl Lemma : loc-on-path-decomp 11,40

es:ES, Sys:AbsInterface(Top), L:(E(Sys) List), j:Id.
loc-on-path(es;j;L)
 (u:E(Sys). (A,B:E(Sys) List. (loc(u) = j & L = (A @ [u / B]) & (loc-on-path(es;j;A))))) 
latex


Definitionst  T, s = t, x:AB(x), x:AB(x), E(X), type List, ES, AbsInterface(A), Id, loc-on-path(es;i;L), A, x:A  B(x), P & Q, x:AB(x), P  Q, Top, [], E, P  Q, P  Q, False, A List, , e  X, S  T, State(ds), State(ds), state@i, vartype(i;x), f(x)?z, f  g, constant_function(f;A;B), r  s, e < e', val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), , , Msg(M), kindcase(ka.f(a); l,t.g(l;t) ), x,yt(x;y), xt(x), Knd, EState(T), f(a), EOrderAxioms(Epred?info), IdLnk, Unit, EqDecider(T), Type, A c B, (last change to x before e), lastchange(x;e), t.1, let x,y = A in B(x;y), isrcv(e), isrcv(k), es-first-from(es;e;l;tg), kind(e), es-init(es;e), destination(l), source(l), {T}, <ab>, a:A fp B(a), loc(e), , as @ bs, [car / cdr], (x  l), Atom$n, {x:AB(x)} , b, P  Q, left + right, Void, strong-subtype(A;B), e(e1,e2].P(e), e[e1,e2].P(e), e[e1,e2].P(e), e[e1,e2).P(e), e[e1,e2).P(e), ee'.P(e), e<e'P(e), ee'.P(e), e<e'.P(e), e c e', (e < e'), e loc e' , (e <loc e'), MaName, l_disjoint(T;l1;l2), Dec(P), kind(e), loc(e)
Lemmasdecidable equal Id, false wf, append wf, es-loc wf, assert wf, subtype rel wf, member wf, es-isrcv-loc, rev implies wf, iff wf, deq wf, unit wf, IdLnk wf, EOrderAxioms wf, EState wf, Knd wf, kindcase wf, Msg wf, nat wf, rationals wf, val-axiom wf, cless wf, qle wf, bool wf, constant function wf, subtype rel list, loc-on-path-cons, es-is-interface wf, loc-on-path-nil, es-E wf, event system wf, es-interface wf, top wf, not wf, loc-on-path wf, Id wf, es-E-interface wf

origin